Testing Input/Output Partial Order Automata
نویسندگان
چکیده
We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be executed non-atomically, reacting to asynchronous inputs on several ports, and producing asynchronous output on those ports. We develop the formal framework for distributed testing in this architecture and compare with the synchronous I/O automaton setting. The advantage of the compact modelling by IOPOA combines with low complexity : the number of tests required for concurrent input in our model is polynomial in the number of inputs.
منابع مشابه
Testing of Partial Order Input/Output Automata
An Input/Output Automaton is an automaton with a finite number of state where each transition is associated with a single input or output interaction. In this paper, we consider a generalization of this formalism, the Partial Order Input/Output Automata (POIOA), in which each transition is associated with a partially ordered set of inputs and outputs. This new formalism allows the specification...
متن کاملTesting Systems Specified as Partial Order Input/Output Automata
An Input/Output Automaton is an automaton with a finite number of states where each transition is associated with a single inpuf or output interaction. In [1], we introduced a new formalism, in which each transition is associated with a bipartite partially ordered set made of concurrent inputs followed by concurrent outputs. In this paper, we generalize this model to Partial Order Input/Output ...
متن کاملDISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملQuiescence , Fairness , Testing , and Implementation ( Extended abstract ) the Notion of
Abs t rac t . Two different formalisms for concurrency are compared and are shown to have common foundations. The Input/Output automaton model and the theory of testing are analyzed in the framework of transition systems. The relationship between the fair and quiescent preorders of I/O automata is investigated and the two preorders are shown to coincide on a large class of automata. I/O automat...
متن کاملQuiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract)
Two diierent formalisms for concurrency are compared and are shown to have common foundations. The Input/Output automaton model and the theory of testing are analyzed in the framework of transition systems. The relationship between the fair and quiescent preorders of I/O automata is investigated and the two preorders are shown to coincide on a large class of automata. I/O automata are encoded i...
متن کامل